Worst-Case Response Time Analysis of Multitype DAG Tasks Based on Reconstruction
نویسندگان
چکیده
With the wide application of heterogeneous multi-core processor real-time systems, existing analysis methods worst-case response time (WCRT) overestimate blocking information among tasks, resulting in a rather pessimistic estimation. To improve accuracy WCRT, we propose reconstruction-based WCRT method for multi-type directed acyclic graph (DAG) tasks scheduling algorithm(RMDS). The RMDS algorithm comprises following steps: First, unitize all task nodes DAG task; Then, use key factors as priorities to schedule and reconstruct model into parallel node segment model; Finally, estimate according assess schedulability. verify performance our algorithm, compared it with traditional algorithms. RDMS showed an acceptance rate 6.13% higher its overall increased by 25.95% comparison
منابع مشابه
Automated Worst-Case Execution Time Analysis Based on Program Modes
A program mode is a regular trajectory of the execution of a program that is determined by the values of its input variables. By exploiting program modes, we may make worst-case execution time (WCET) analysis more precise. This paper presents a novel method to automatically find program modes and calculate the WCET estimates of programs. First, the modes of a program will be identified automati...
متن کاملExisting worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption refuted
This paper revisits worst-case response time analysis of real-time tasks under fixed priority scheduling with deferred preemption (FPDS), arbitrary phasing, and deadlines within periods. We show that existing worst-case response time analysis, as presented in [3, 4, 5], is too optimistic. In particular, the worst-case response time of a task is not necessarily assumed for the first job of that ...
متن کاملExisting worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption is too optimistic
This paper revisits response time analysis of real-time tasks under fixed priority scheduling with deferred preemption (FPDS), arbitrary phasing, and deadlines within periods. We show that existing worst-case response time analysis, as presented in [5, 6, 7], is too optimistic. In particular, the worst-case response time of a task is not necessarily assumed for the first job of that task when r...
متن کاملWorst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption revisited
Fixed-priority scheduling with deferred preemption (FPDS) has been proposed in the literature as a viable alternative to fixed-priority pre-emptive scheduling (FPPS), that obviates the need for non-trivial resource access protocols and reduces the cost of arbitrary preemptions. This paper shows that existing worst-case response time analysis of hard real-time tasks under FPDS, arbitrary phasing...
متن کاملExact worst-case response times of real-time tasks under fixed-priority scheduling with deferred preemption
In this paper, we present equations to determine the exact worst-case response times of periodic tasks under fixedpriority scheduling with deferred preemption (FPDS) and arbitrary phasing. We show that the worst-case response time analysis is not uniform for all tasks. Our exact analysis is based on a dedicated conjecture for an ε-critical instant, and uses the notion of worst-case occupied time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2022
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2022.3203590